Capacitated Vehicle Routing Problems Based on Multi-heuristics with Balanced Search Control Particle Swarm Optimization
نویسندگان
چکیده
In this article, particle swarm optimization (PSO) is adopted to solve capacitated vehicle routing problems (CVRPs). In order to obtain high quality and diverse initial solutions to facilitate the subsequent search for optimal solutions by PSO, a sweep algorithm is combined with greedy randomized adaptive search procedure (GRASP) to produce high quality initial solutions, and an initial heuristic rate is also used to generate an initial solution with diversity. Meanwhile, a nonlinear S-decreasing curve is also employed to adjust the inertia weight of PSO to balance global and local searches. Moreover, local search and path relink with controlling rate are also involved to improve the quality of the solutions. Experiments were conducted on Augerat problems from the OR Library. Experimental results are compared with those from other studies and demonstrate that the algorithm designed in this study can effectively solve capacitated type vehicle routing problems.
منابع مشابه
An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA multi-objective Two-Echelon Capacitated Vehicle Routing Problem for perishable products
This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...
متن کاملA Promoted Hybrid Heuristic Algorithm for Two-dimensional Multi-depots Vehicle Routing Problem
In this paper, a multi-depots capacitated vehicle routing problem where client demand is composed of two-dimensional weighted items (2L-MDCVRP) is addressed. The problem calls for the minimization of the cost of transportation needed for the delivery of the goods demanded by the clients, and carried out by a fleet of vehicles based at several depots. The overall problem, denoted as 2L-MDCVRP, i...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کامل